Theorem, Turing machine non-computable function

Theorem

There exists a function $\mathtt{UC}: \{0,1\}^* \to \{0,1\}$ that is not computable by any TM.

References

1. S. Arora, B. Barak. Computational Complexity: A Modern Approach, Cambridge University Press, 2009, p. 22.